Stochastic Programming Models and Hybrid Intelligent Algorithm for Unbalanced Bidding Problem
نویسندگان
چکیده
The expected value model and the chance-constrained programming model for unbalanced bidding problem are established on the condition that quantities of each activity are stochastic variables and the total project is finished smoothly in this paper. These models can make the unbalanced bidding price more reasonable and applicable. In order to solve these models, stochastic simulation, neural network and genetic algorithm are integrated to produce a hybrid intelligent algorithm. Finally, a numerical example is given to illustrate its effectiveness.
منابع مشابه
A New Hybrid Algorithm to Optimize Stochastic-fuzzy Capacitated Multi-Facility Location-allocation Problem
Facility location-allocation models are used in a widespread variety of applications to determine the number of required facility along with the relevant allocation process. In this paper, a new mathematical model for the capacitated multi-facility location-allocation problem with probabilistic customer's locations and fuzzy customer’s demands under the Hurwicz criterion is proposed. Thi...
متن کاملStrategic Bidding in a Pool-Based Electricity Market under Load Forecast Uncertainty
This paper proposes a method for determining the price bidding strategies of market participants consisting of Generation Companies (GENCOs) and Distribution Companies (DISCOs) in a day-ahead electricity market, while taking into consideration the load forecast uncertainty and demand response programs. The proposed algorithm tries to find a Pareto optimal point for a risk neutral participan...
متن کاملA hybrid CS-SA intelligent approach to solve uncertain dynamic facility layout problems considering dependency of demands
This paper aims at proposing a quadratic assignment-based mathematical model to deal with the stochastic dynamic facility layout problem. In this problem, product demands are assumed to be dependent normally distributed random variables with known probability density function and covariance that change from period to period at random. To solve the proposed model, a novel hybrid intelligent algo...
متن کاملModel and Solution Approach for Multi objective-multi commodity Capacitated Arc Routing Problem with Fuzzy Demand
The capacitated arc routing problem (CARP) is one of the most important routing problems with many applications in real world situations. In some real applications such as urban waste collection and etc., decision makers have to consider more than one objective and investigate the problem under uncertain situations where required edges have demand for more than one type of commodity. So, in thi...
متن کاملOptimal Bidding Strategies of GENCOs in Day-Ahead Energy and Spinning Reserve Markets Based on Hybrid GA-Heuristic Optimization Algorithm
In an electricity market, every generation company (GENCO) attempts to maximize profit according to other participants bidding behaviors and power systems operating conditions. The goal of this study is to examine the optimal bidding strategy problem for GENCOs in energy and spinning reserve markets based on a hybrid GA-heuristic optimization algorithm. The heuristic optimization algorithm used...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer and Information Science
دوره 2 شماره
صفحات -
تاریخ انتشار 2009